\documentclass[11pt]{article}
%\usepackage{authblk}
\usepackage{amsmath,amssymb,amsthm}
%\usepackage{epsfig, graphicx}
\usepackage{multicol}
%\usepackage{algorithmic,algorithm}
\usepackage{color}

\usepackage[left=1in,top=1in,right=1in,bottom=1in,nohead]{geometry}
%\usepackage{fullpage}
%\usepackage{subfigure}
%\usepackage{times}
%\usepackage{url}

\begin{document}
\input{macros}
\begin{titlepage}

\title{More on a Problem of Zarankiewicz}

\author{Chinmoy Dutta \thanks{College of Computer and Information
    Science, Northeastern University, Boston MA 02115, USA.  E-mail:
    {\tt chinmoy@ccs.neu.edu}.  Chinmoy Dutta is supported in part by
    NSF grant CCF-0845003 and a Microsoft grant to Ravi Sundaram.}
  \and Jaikumar Radhakrishnan \thanks{School of Technology and
    Computer Science, Tata Institute of Fundamental Research, Mumbai
    400005, India. Email:{\tt jaikumar@tifr.res.in}.}}

\junk{
\author{Chinmoy Dutta\inst{1} \fnmsep \thanks{Chinmoy Dutta is
    supported in part by NSF grant CCF-0845003 and a Microsoft grant
    to Ravi Sundaram.} \and Jaikumar Radhakrishnan\inst{2}}

\institute{College of Computer and Information Science \\ Northeastern
  University, Boston MA 02115, USA \\ \email{chinmoy@ccs.neu.edu} \and
  School of Technology and Computer Science \\ Tata Institute of
  Fundamental Research, Mumbai 400005, India
  \\ \email{jaikumar@tifr.res.in}}
}


%\subjclass{G.2.2 [DISCRETE MATHEMATICS]: Graph Theory---Network
%problems, Graph algorithms; G.2.1 [DISCRETE MATHEMATICS]:
%Combinatorics---Counting problems, Combinatorial algorithms}

\date{}

\maketitle

\thispagestyle{empty}

\input{abstract}

{\bf Keywords:} Zarankiewicz problem, superconcentrators, bipartite graphs,
independent sets, probabilistic method.

\end{titlepage}

\input{intro}
\input{symmetric}
\input{asymmetric}
\input{superconcentrator}

\bibliographystyle{plain}
\bibliography{zarankiewicz}

\end{document}
